The Box Algebra = Petri Nets + Process

نویسندگان

  • Eike Best
  • Raymond Devillers
  • Maciej Koutny
چکیده

The paper describes a Petri net as well as a structural operational semantics for an algebra of process expressions. It speciically addresses this problem for the box algebra, a model of concurrent computation which combines Petri nets and standard process algebras. The main result is that it is possible to obtain a framework where process expressions can be given two, entirely consistent, kinds of semantics: one based on Petri nets, the other on SOS rules. This consistency can also be extended to a partial order semantics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Petri Nets, Process Algebras and Concurrent Programming Languages

This paper discusses issues that arise when process algebras and Petri nets are linked; in particular, operators, compositionality, recursion, refinement and equivalences. It uses the box algebra in order to show how Petri nets can be manipulated algebraically. Also, the paper shows how process algebras such as CCS, COSY and CSP can be treated in the same way, how Petri net semantics of concurr...

متن کامل

An Algebra of Timed-Arc Petri Nets

In this paper we present and investigate two algebras, one based on term re-writing and the other on Petri nets, aimed at the specification and analysis of concurrent systems with timing information. The former is based on process expressions (at-expressions) and employs a set of SOS rules providing their operational semantics. The latter is based on a class of Petri nets with time restrictions...

متن کامل

Operational Semantics for PBC with Asynchronous Communication

This paper presents two related algebras which can be used to specify and analyse concurrent systems with synchronous and asynchronous communications. The first algebra is based on a class of P/T-nets, called boxes, and their standard transition firing rule. It is an extension of the Petri Box Calculus (PBC). Essentially, the original model is enriched with the introduction of special ‘buffer’ ...

متن کامل

Asynchronous Box Calculus

The starting point of this paper is an algebraic Petri net framework allowing one to express net compositions, such as iteration and parallel composition, as well as transition synchronisation and restriction. We enrich the original model by introducing new constructs supporting asynchronous interprocess communication. Such a communication is made possible thanks to special ‘buffer’ places wher...

متن کامل

A New Synchronization in Finite Stochastic Petri Box Calculus

The Petri Box Calculus (PBC) combines two well known paradigms of the design of concurrent systems: process algebras and Petri nets. In our first proposal of sPBC (stochastic PBC) [12] we defined a Markovian extension of finite PBC, i.e., we had a Markovian process algebra for which both an operational and a denotational (based on stochastic Petri nets) semantics were defined. Our goal in this ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999